Generalized Simulated Annealing
نویسنده
چکیده
We propose a new stochastic algorithm (generalized simulated annealing) for computationally finding the global minimum of a given (not necessarily convex) energy/cost function defined in a continuous D-dimensional space. This algorithm recovers, as particular cases, the so called classical (“Boltzmann machine”) and fast (“Cauchy machine”) simulated annealings, and can be quicker than both. Key-words: Simulated annealing; Nonconvex optimization; Gradient descent; Generalized Statistical Mechanics.
منابع مشابه
N-ary Speculative Computation of Simulated Annealing on the AP1000 Massively Parallel Multiprocessor
Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for realistic problem size, however, has been limited by the long execution time due to its sequential nature. This report presents a practical approach to synchronous simulated annealing for massively parallel distributed-memory multiprocessors. We use an n-ary speculative tree to execute ...
متن کاملGeneralized simulated annealing algorithms using Tsallis statistics: Application to conformational optimization of a tetrapeptide.
A Monte Carlo simulated annealing algorithm based on the generalized entropy of Tsallis is presented. The algorithm obeys detailed balance and reduces to a steepest descent algorithm at low temperatures. Application to the conformational optimization of a tetrapeptide demonstrates that the algorithm is more effective in locating low energy minima than standard simulated annealing based on molec...
متن کاملSimulated Annealing Using Hybrid Monte Carlo
We propose a variant of the simulated annealing method for optimization in the multivhriate analysis of differentiable functions. The method uses global actualizations via the hybrid Monte Carlo algorithm in their generalized version for the proposal of new configurations. We show how this choice can improve upon the performance of simulated annealing methods (mainly when the number of variable...
متن کاملGeneralized simulated annealing: Application to silicon clusters
We have compared the recently introduced generalized simulated annealing ~GSA! with conventional simulated annealing ~CSA!. GSA was tested as a tool to obtain the ground-state geometry of molecules. We have used selected silicon clusters (Sin , n54 – 7,10) as test cases. Total energies were calculated through tightbinding molecular dynamics. We have found that the replacement of Boltzmann stati...
متن کاملConvergence of simulated annealing by the generalized transition probability
We prove weak ergodicity of the inhomogeneous Markov process generated by the generalized transition probability of Tsallis and Stariolo under power-law decay of the temperature. We thus have a mathematical foundation to conjecture convergence of simulated annealing processes with the generalized transition probability to the minimum of the cost function. An explicitly solvable example in one d...
متن کامل